Resource Allocation for Quality of Service Provision in Buffered Crossbar Switches with Traffic Aggregation
نویسنده
چکیده
The capability of providing quality of service (QoS) in packet switches of computer networks is critical to implementation of distributed multimedia systems. The buffered crossbar switching architecture is promising to achieve high performance without complex implementation. In this paper, we study the problem of resource allocation to aggregated traffic classes in buffered crossbar switches for QoS provision. We develop techniques for determining the required amount of bandwidth and buffer space for aggregated traffic classes to provide delay performance guarantee, and analyze the impact of traffic aggregation on resource utilization in buffered crossbar switches. We consider two traffic aggregation cases: aggregation of a set of flows with identical traffic profiles, and aggregation of a set of flows with different traffic parameters. For both cases, we compare the amount of resources required by the aggregated class and by the set of individual flows for guaranteeing identical delay objectives. We find that traffic aggregation reduces both bandwidth and buffer space requirements, and the amount of resources saved by aggregation is associated with multiple factors, including the delay objective, the arrival traffic parameters, and the number of flows aggregated into one class.
منابع مشابه
Starvation Free Scheduler for Buffered Crossbar Switches (RESEARCH NOTE)
Need for high speed internet connectivity has lead to a substantial research in switching systems. Buffered crossbar switches have received a lot of attention from both research and industrial communities due of its flexibility and scalability. Designing a scheduling algorithm for buffered crossbar switches without starvation is a major challenge as of now. In this paper, we proposed a Delay ba...
متن کاملNovel High Performance Scheduling Algorithms for Crosspoint Buffered Crossbar Switches
-Crosspoint buffered crossbar switches have gained much attention due to simple distributed scheduling algorithms. However, almost all the algorithms proposed for buffered crossbar switches either have unsatisfactory scheduling performance under non-uniform traffic or poor service fairness between input traffic flows. In order to overcome the disadvantages, in this paper we propose a novel effi...
متن کاملRate Quantization and Service Quality for Variable Rate Traffic over Single Crossbar Switches
We study the provision of deterministic rate guarantees over single crossbar switches. Birkhoff decomposition yields a general approach for this problem, but the required complexity can be very high and the quality of service can be unsatisfactory for practical traffic sources. We develop a method called rate quantization which converts the set of desired rates into a certain discrete set in su...
متن کاملMulticast Traffic Scheduling Based On High-Speed Crossbar Switches
The tremendous growth of the Internet coupled with newly emerging applications has created a vital need for multicast traffic support by backbone routers and ATM switches. In this paper, we first introduce the multicast traffic scheduling problem. We focus our study on the multicast traffic scheduling in crossbar based input queued (IQ) switches. Due to the centralized scheduling complexity in ...
متن کاملOn Service Guarantees for Input Buffered Crossbar Switches: A Capacity Decomposition Approach by Birkhoff and von Neumann
Based on a decomposition result by Birkhoff and von Neumann for a doubly substochastic matrix, in this paper we propose a scheduling algorithm that is capable of providing service guarantees for input-buffered crossbar switches. Our service guarantees are uniformly good for all non-uniform traffic, and thus imply 100% throughput. The off-line computational complexity to identify the scheduling ...
متن کامل